SAGA 2003 : stochastic algorithms : foundations and applications (Hatfield, 22-23 September 2003)Albrecht, Andreas; Steinhöfel, Kathleen.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20103-3, VIII, 166 p, isbn 3-540-20103-3Conference Proceedings

Fast algorithms for approximately counting mismatchesKARLOFF, H.Information processing letters. 1993, Vol 48, Num 2, pp 53-60, issn 0020-0190Article

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMSCHEN, Jianer; KNEIS, Joachim; LU, Songjian et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2526-2547, issn 0097-5397, 22 p.Article

Capturing an Evader in a Building : Computational geometry in navigation and path planningSUZUKI, Ichiro; ZYLINSKI, Pawel.IEEE robotics & automation magazine. 2008, Vol 15, Num 2, pp 16-26, issn 1070-9932, 11 p.Article

Average-case complexity of partial Boolean functionsCHASHKIN, Alexander.Lecture notes in computer science. 2003, pp 146-156, issn 0302-9743, isbn 3-540-20103-3, 11 p.Conference Paper

LT codesLUBY, Michael.Annual Symposium on Foundations of Computer Science. 2002, pp 271-280, isbn 0-7695-1822-2, 10 p.Conference Paper

On the decidability of self-assembly of infinite ribbonsADLEMAN, Leonard; KARI, Jarkko; KARI, Lila et al.Annual Symposium on Foundations of Computer Science. 2002, pp 530-537, isbn 0-7695-1822-2, 8 p.Conference Paper

Designing algorithms by expectationsGIL, J; MATIAS, Y.Information processing letters. 1994, Vol 51, Num 1, pp 31-34, issn 0020-0190Article

Computations of probabilistic output admissible set for uncertain constrained systemsHATANAKA, Takeshi; TAKABA, Kiyotsugu.Automatica (Oxford). 2008, Vol 44, Num 2, pp 479-487, issn 0005-1098, 9 p.Article

On the one-sided crossing minimization in a bipartite graph with large degreesNAGAMOCHI, Hiroshi.Theoretical computer science. 2005, Vol 332, Num 1-3, pp 417-446, issn 0304-3975, 30 p.Article

A randomized satisfiability procedure for arithmetic and uninterpreted function symbolsGULWANI, Sumit; NECULA, George C.Information and computation (Print). 2005, Vol 199, Num 1-2, pp 107-131, issn 0890-5401, 25 p.Conference Paper

Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper boundCHAKRABARTY, Deeparnab; KÖNEMANN, Jochen; PRITCHARD, David et al.Operations research letters. 2010, Vol 38, Num 6, pp 567-570, issn 0167-6377, 4 p.Article

Motorcycle graphs and straight skeletonsCHENG, Siu-Wing; VIGNERON, Antoine.Algorithmica. 2007, Vol 47, Num 2, pp 159-182, issn 0178-4617, 24 p.Article

Locally guided randomized elections in trees : The totally fair caseMETIVIER, Yves; SAHEB-DJAHROMI, Nasser; ZEMMARI, Akka et al.Information and computation (Print). 2005, Vol 198, Num 1, pp 40-55, issn 0890-5401, 16 p.Article

Testing whether a digraph contains H-free k-induced subgraphsLIN, Hong-Yiu; LYUU, Yuh-Dauh; MA, Tak-Man et al.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 545-553, issn 0304-3975, 9 p.Article

New results for online page replicationFLEISCHER, Rudolf; GŁAZEK, Włodzimierz; SEIDEN, Steve et al.Theoretical computer science. 2004, Vol 324, Num 2-3, pp 219-251, issn 0304-3975, 33 p.Article

Randomized computation with cellular automataCHOPARD, Bastien; TOMASSINI, Marco.Lecture notes in computer science. 2004, pp 71-80, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

Testing low-degree polynomials over prime fieldsJUTLA, Charanjit S; PATTHAK, Anindya C; RUDRA, Atri et al.Annual Symposium on Foundations of Computer Science. 2004, pp 423-432, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Better algorithms for unfair metrical task systems and applicationsFIAT, Amos; MENDEL, Manor.SIAM journal on computing (Print). 2003, Vol 32, Num 6, pp 1403-1422, issn 0097-5397, 20 p.Article

A parallel randomized algorithm for finding a maximal independent set in a linear hypergraphŁUCZAK, T; SZYMANSKA, E.Journal of algorithms (Print). 1997, Vol 25, Num 2, pp 311-320, issn 0196-6774Article

Extracting randomness using few independent sourcesBARAK, Boaz; IMPAGLIAZZO, Russell; WIGDERSON, Avi et al.Annual Symposium on Foundations of Computer Science. 2004, pp 384-393, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Stochastic DFS for multiprocessor scheduling of cyclic taskgraphsSANDNES, Frode Eika; SINNEN, Oliver.Lecture notes in computer science. 2004, pp 354-362, issn 0302-9743, isbn 3-540-24013-6, 9 p.Conference Paper

A Stochastic Traffic Assignment Algorithm Based on Ant Colony OptimisationD'ACIERNO, Luca; MONTELLA, Bruno; DE LUCIA, Fortuna et al.Lecture notes in computer science. 2006, pp 25-36, issn 0302-9743, isbn 3-540-38482-0, 1Vol, 12 p.Conference Paper

Randomized approximations of parameterized counting problemsMÜLLER, Moritz.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 10 p.Conference Paper